PUSHING LOG-BASED RECONCILIATION

Distributed Log-Based Reconciliation

Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this work, we present four distributed algorithms for log-based reconciliation, an important NP-hard problem occurring in CSCW. Our methods remove the classical drawbacks of centralized systems like single point of failure, ...

Cycle-cut decomposition and log-based reconciliation

Optimistic reconciliation allows, multiple update of shared data without synchronization. The assumption is that the vast majority of the actions will not conflict. In those systems, write availability is raised in the presence of network failures, high latencies or parallel development. However, in order to remain consistent, optimistic systems repair divergences. To produce a new consistent s...

CLP versus LS on Log-based Reconciliation Problems

Nomadic applications create replicas of shared objects that evolve independently while they are disconnected. When reconnecting, the system has to reconcile the divergent replicas. In the log-based approach to reconciliation, such as in the IceCube system, the input is a common initial state and logs of actions that were performed on each replica. The output is a consistent global schedule that...

A Constraint Programming Approach to Log-based Reconciliation Problems for Nomadic Applications

Template Based Recovery of Fourier-Based Watermarks Using Log-Polar and Log-Log Maps

Digital watermarks have been proposed as a method for discouraging illicit copying and distribution of copyrighted material. This paper describes a method for the secure and robust copyright protection of digital images. We present an approach for embedding a digital watermark into an image using the fast Fourier transform. To this watermark is added a template in the Fourier transform domain t...